A Quick Adaptation Method for Constraint Satisfaction in a Real-time Environment

نویسندگان

  • Hiromitsu Hattori
  • Takayuki Ito
چکیده

Multi-agent problem solving in a real-time environment is one of the hardest and most fascinating research area. In this paper, we propose a method for quick adaptation to changes in a problem in a real-time environment as an extension of an Asynchronous Weak-commitment (AWC) search algorithm. The basic idea of our proposing method is to limit the scope of search. Variables which are affected by changes could be modified their previously assigned values to adapt to the changes. For the adaptation to changes in a problem, we sacrifice the optimality of a solution. If an agent can increase its utility, it can simply modify its values. In the process, an agent emphasizes the local optimality without considering the global optimality. In a real-time environment, it is not practically important to globally optimize a solution. The quick adaptation to changes can be useful for such real-time problem.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Deep Unsupervised Domain Adaptation for Image Classification via Low Rank Representation Learning

Domain adaptation is a powerful technique given a wide amount of labeled data from similar attributes in different domains. In real-world applications, there is a huge number of data but almost more of them are unlabeled. It is effective in image classification where it is expensive and time-consuming to obtain adequate label data. We propose a novel method named DALRRL, which consists of deep ...

متن کامل

Solving Timetabling Problems Using Genetic Algorithms Based on Minimizing Conflict Heuristics

This paper describes techniques that can be applied to large-scale real-life employee timetabling problems. The problems are characterized as constraint satisfaction problems. The solution methodology uses genetic algorithms to minimize the total penalty for constraint violation. An encoding for search space reduction, genetic operation for a quick accumulation of partial solutions, and a penal...

متن کامل

Solving Temporal Constraints in Real Time and in a Dynamic Environment

In this paper we will present a study of different resolution techniques for solving Constraint Satisfaction Problems (CSP) in the case of temporal constraints. This later problem is called Temporal Constraint Satisfaction Problem (TCSP). We will mainly focus here on solving TCSPs in real time and in a dynamic environment. Indeed, addressing these two issues is very relevant for many real world...

متن کامل

A multi-objective mathematical model for nurse scheduling problem with hybrid DEA and augmented ε-constraint method: A case study

The efficient management of nursing personnel is of vital importance in a hospital’s environment comprising a vast share of the hospital’s operational costs. In the nurse scheduling problem (NSP), the target is to allocate shifts to the nurses in order to satisfy the hospital’s demand during the planning horizon by considering different objective functions. This paper presents a multi-objective...

متن کامل

Adaptation Using Constraint Satisfaction Techniques

Case adaptation, a central component of case-based reasoning, is often considered to be the most difficult part of a casebased reasoning system. The difficulties arise from the fact that adaptation often does not converge, especially if it is not done in a systematic way. This problem, sometimes termed the assimilation problem, is especially pronounced in the case-based design problem solving d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006